Exploring the Queueing Behaviour of ATM Switches
نویسندگان
چکیده
In this paper we describe methods which we have used to verify queueing models of two ATM switches, namely the Fairisle ATM switch developed at Cambridge University Computer Laboratory and an AT&T Globeview 2000 switch installed in the experimental test-bed at Telia Research Laboratories. Our approach relies on methods from large deviation theory, which we believe provides an appropriate scale on which agreement may be expected between a simple model and an actual ATM switch. We found that for the purpose of estimating delays the single-server queue provides an adequate model, at the large deviation scale, of both switches under the conditions investigated. However it does not reproduce the output behaviour of the Globeview switch at high loads. The model was evaluated using both analytic techniques and simulation. We emphasize that the model is not exact, indicating that very complex models may be required in order to obtain results more detailed than those aaorded by large deviation theory. This calls into question the common practice of using detailed models of network traac in conjunction with simpliied models of the network itself.
منابع مشابه
Response Time Guarantees for Atm-networked Control Systems
We present the Response-Time Analysis (RTA) method for providing real-time guarantees in Asynchronous Transfer Mode (ATM) communication networks, and evaluates its suitability for use in hard real-time factory-type environments. RTA provides an analysis of the network tra c which can be used by an admission control mechanism to determine if the timing requirements of a new connection can be gua...
متن کاملAccurate modelling of the queueing behaviour of shared buffer ATM switches
A model for the analysis of multistage switches based on shared bu!er switching for Asynchronous Transfer Mode (ATM) networks is developed, and the results are compared with the simulation. Switches constructed from shared bu!er switches do not su!er from the head of line blocking which is the common problem in simple input bu!ering. The analysis models the state of the entire switch and extend...
متن کاملQueueing analysis of buffered switching networks
This paper provides a method for analyzing the queueing behavior of switching net works constructed from switches that employ shared bu ering or parallel bypass input bu er ing It extends the queueing models rst intro duced by Jenq and later generalized by Szyman ski and Shaikh to handle these classes of networks Our analysis explicitly models the state of an en tire switch and infers informati...
متن کاملHigh Speed Networks EFFICIENT SCHEDULING OF VARIABLE-LENGTH IP PACKETS ON HIGH-SPEED SWITCHES*
ATM switches have been proposed as the switching fabric cores of many high-performance IP switches. In this paper, we present an efficient algorithm called IPPIM for scheduling variable-length IP packets on these switches and compare its performance with the original parallel iterative matching (PIM) ATM cell scheduling algorithm. The mean IP packet delays using both the PIM and the IP-PIM sche...
متن کاملPerformance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic
In this letter, we analyze the performance of multiple input-queued asynchronous transfer mode (ATM) switches that use parallel iterative matching for scheduling the transmission of head-of-line cells in the input queues. A queueing model of the switch is developed under independently, identically distributed, two-state Markov modulated Bernoulli processes bursty traffic. The underlying Markov ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 27/28 شماره
صفحات -
تاریخ انتشار 1996